A Scalable Sampling-Based Optimal Path Planning Approach via Search Space Reduction
نویسندگان
چکیده
منابع مشابه
A sub-optimal sampling based method for path planning
In this paper a search algorithm is proposed to find a sub optimal path for a non-holonomic system. For this purpose the algorithm starts sampling the front part of the vehicle and moves towards the destination with a cost function. The bicycle model is used to define the non-holonomic system and a stability analysis with different integration methods is performed on the dynamics of the system....
متن کاملFiltering, Decomposition and Search Space Reduction for Optimal Sequential Planning
We present in this paper a hybrid planning systemwhich combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its own consistency rules and filtering and decomposition mechanisms suitable for planning. Given a fixed bound on the plan length, our planner works directly on a structure related to Graphplan’s planning graph. This struc...
متن کاملPotential functions based sampling heuristic for optimal path planning
Rapidly-exploring Random Tree Star(RRT*) is a recently proposed extension of Rapidly-exploring Random Tree (RRT) algorithm that provides a collisionfree, asymptotically optimal path regardless of obstacles geometry in a given environment. However, one of the limitation in the RRT* algorithm is slow convergence to optimal path solution. As a result it consumes high memory as well as time due to ...
متن کاملSampling-based algorithms for optimal path planning problems
Sampling-based motion planning received increasing attention during the last decade. In particular, some of the leading paradigms, such the Probabilistic RoadMap (PRM) and the Rapidly-exploring Random Tree (RRT) algorithms, have been demonstrated on several robotic platforms, and found applications well outside the robotics domain. However, a large portion of this research effort has been limit...
متن کاملInformed Sampling for Asymptotically Optimal Path Planning
Anytime almost-surely asymptotically optimal planners, such as RRT*, incrementally find paths to every state in the search domain. This is inefficient once an initial solution is found as then only states that can provide a better solution need to be considered. Exact knowledge of these states requires solving the problem but can be approximated with heuristics. This paper formally defines thes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2948976